Predicate transformer semantics of a higher-order imperative language with record subtyping

Predicate transformer semantics of a higher-order imperative language with record subtyping

Using a set-theoretic model of predicate transformers and ordered data types, we give a total-correctness semantics for a higher order imperative programming language that includes record extension, local variables, and procedure-type variables and parameters. The language includes infeasible speciication constructs, for a calculus of reenement. Procedures may have global variables, subject to ...

Predicate Transformer Semantics of a Higher Order Imperative Language With . . .

A Predicate Transformer Semantics for a Concurrent Language of Refinement

Circus is a combination of Z and CSP; its chief distinguishing feature is the inclusion of the ideas of the refinement calculus. Our main objective is the definition of refinement methods for concurrent programs. The original semantic model for Circus is Hoare and He’s unifying theories of programming. In this paper, we present an equivalent semantics based on predicate transformers. With this ...

Relating direct and predicate transformer partial correctness semantics for an imperative probabilistic-nondeterministic language

where b ranges over a set BExp of boolean expressions, a ranges over a set Act of basic actions and p is a real number with 0 < p < 1. The aim of the current paper is to perform this task for the partial correctness case where the direct semantics of a program P is given by a function from the set S of states to PLV(S), the convex lower powerdomain of valuations on S. Here V(S) is the set of al...

Typed operational semantics for higher-order subtyping

Bounded operator abstraction is a language construct relevant to object oriented programming languages and to ML2000, the successor to Standard ML. In this paper, we introduce Fω ≤, a variant of Fω <: with this feature and with Cardelli and Wegner’s kernel Fun rule for quantifiers. We define a typed operational semantics with subtyping and prove that it is equivalent with Fω ≤, using a Kripke m...